A new analysis technique for the Sprouts Game

نویسندگان

  • RICCARDO FOCARDI
  • FLAMINIA L. LUCCIO
چکیده

Sprouts is a two players game that was first introduced by M.S. Patterson and J.H. Conway in 1967. There are two players A and B that starting from a set of x0 vertices draw a plane graph by alternatively connecting any pair of two vertices with degree less than three with an edge, and by inserting a new vertex in the new edge. The move is possible if and only if the new connection maintains the planarity of the graph. The player that executes the last possible move is the winner. We study some new topological properties of the Sprouts Game and we show their effectiveness by giving a complete analysis of the case x0 = 7, for which no formal proof is, to the best of our knowledge, known.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Misère Sprouts Game with Reduced Canonical Trees

Sprouts is a two-player topological game, invented in 1967 by Michael Paterson and John Conway. The game starts with p spots, lasts at most 3p − 1 moves, and the player who makes the last move wins. In the misère version of Sprouts, on the contrary, the player who makes the last move loses. Sprouts is a very intricate game, and the first computer analysis in 1991 reached only p = 11. New result...

متن کامل

Dynamic system of strategic games

Maybe an event can't be modeled completely through one game but there is more chance with several games. With emphasis on players' rationality, we present new properties of strategic games, which result in production of other games. Here, a new attitude to modeling will be presented in game theory as dynamic system of strategic games and its some applications such as analysis of the clash betwe...

متن کامل

Complexity of the Game of Sprouts

Sprouts is a simple, yet analytically interesting, game first developed in 1967 by Michael Paterson and John Conway. Mathematicians have analyzed the game for various strategies and mathematical properties. This paper adds to the body of knowledge by presenting a proof that several problems in the Game of Sprouts are NP-complete. In addition, for anyone wanting to conduct further research on th...

متن کامل

A New Method in Bankruptcy Assessment Using DEA Game Theory

One of the most important economic concepts is evaluation and bankruptcy prediction. Financial events, which an organization could be, exposed to serious risks and it goes bankruptcy. Therefore, prediction and assessment bankruptcy enable organizations that to be familiar the financial risks and resolve their financial deficiencies. So in this paper, we discuss one of the most important economi...

متن کامل

Sprouts Game on Compact Surfaces

Sprouts is a two-player topological game, invented in 1967 by Michael Paterson and John Conway. The game starts with p spots drawn on a sheet of paper, and lasts at most 3p − 1 moves : the player who makes the last move wins. Sprouts is a very intricate game and the best known manual analysis only achieved to find a winning strategy up to p = 7 spots. Recent computer analysis reached up to p = ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007